Global optimization and multi knapsack: A percolation algorithm
نویسندگان
چکیده
منابع مشابه
Global optimization and multi knapsack: A percolation algorithm
Since the standard multi knapsack problem, may be rewritten as a reverse convex problem, we present a global optimization approach. It is known from solving high dimensional nonconvex problems that pure cutting plane methods may fail and branch-and-bound is impractical, due to a large duality gap. On the other hand, a strategy based on some sufficient optimality condition does not help much bec...
متن کاملInvasion percolation and global optimization.
Flow in a porous medium, a problem with important practical applications, has motivated a large number of theoretical and experimental studies [1]. Aiming to understand the complex interplay between the dynamics of flow processes and randomness characterizing the porous medium, a number of models have been introduced that capture different aspects of various experimental situations. One of the ...
متن کاملA Robust Knapsack Based Constrained Portfolio Optimization
Many portfolio optimization problems deal with allocation of assets which carry a relatively high market price. Therefore, it is necessary to determine the integer value of assets when we deal with portfolio optimization. In addition, one of the main concerns with most portfolio optimization is associated with the type of constraints considered in different models. In many cases, the resulted p...
متن کاملImproved Cuckoo Search Algorithm for Global Optimization
The cuckoo search algorithm is a recently developedmeta-heuristic optimization algorithm, which is suitable forsolving optimization problems. To enhance the accuracy andconvergence rate of this algorithm, an improved cuckoo searchalgorithm is proposed in this paper. Normally, the parametersof the cuckoo search are kept constant. This may lead todecreasing the efficiency of the algorithm. To cop...
متن کاملSolving A Multi-Dimensional Knapsack Problem Using A Hybrid Particle Swarm Optimization Algorithm
In this paper, an optimisation technique based on the Particle Swarm Optimization (PSO) algorithm will be experimented upon the Multi-dimensional Knapsack Problem. Through the merging of fundamental concepts of the existing PSO algorithm and selected features of evolutionary algorithms, a novel hybrid algorithm is created. When testing the algorithm against a test suite publicly available on OR...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: European Journal of Operational Research
سال: 2004
ISSN: 0377-2217
DOI: 10.1016/s0377-2217(02)00858-5